Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm
نویسندگان
چکیده
منابع مشابه
Voter Verifiability in Homomorphic Election Schemes
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...
متن کاملA Practical Voter-Verifiable Election Scheme
We present an election scheme designed to allow voters to verify that their vote is accurately included in the tabulation. The scheme provides a high degree of transparency whilst ensuring the secrecy of votes. Assurance is derived from close auditing of all the steps of the vote recording and counting process with minimal dependence on the system components. Thus, assurance arises from verific...
متن کاملThe Prêt à Voter Verifiable Election System
The Prêt à Voter election system has undergone several revisions and enhancements since its inception in 2004, resulting in a family of election systems designed to provide end-to-end verifiability and a high degree of transparency while ensuring secrecy of the ballot. Assurance for these systems arises from the auditability of the election itself, rather than the need to place trust in the sys...
متن کاملVoter Choice and Candidate Uncertainty
When citizens enter the voting booth on election day, they do so in an environment where the stakes are often unclear. Over the last 40 years, political scientists have been interested in the choice dynamics at work in such situations. Recent work in political science has taken up the question of issue voting under conditions of uncertainty—situations in which voters have imperfect information ...
متن کاملApproximation algorithms and the hardness of approximation
Chandra Chekuri (Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL), Joseph Cheriyan (Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON), Ryan O’Donnell (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA), Mohammad R. Salavatipour (Dept. of Computing Science, University of Alberta, Edmonton, AL), David Williamson (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33012572